運輸網絡是一種專門的數學結構,用於模擬商品、資料或物料透過受限制通道系統的流動。它通過指定特定的起點與終點,將一個標準的有向圖轉化為一個功能性框架,同時在系統內每條連接上施加物理性的「瓶頸」限制。
運輸網絡的定義
根據 定義 10.1.1,運輸網絡(或簡稱網絡)是一個簡單、加權、有向圖,必須滿足三個核心條件:
性質 (a):源點
一個指定的頂點,即 源點 ($a$ 或 $s$),代表起點。其入度為零(無任何邊進入),作為無限供應者。
性質 (b):匯點
一個指定的頂點,即 匯點 ($z$ 或 $t$),代表最終消費端。其出度為零(無任何邊離開)。
性質 (c):容量
每條有向邊 $(i, j)$ 的權重 $C_{ij}$ 稱為其 容量。該值必須為非負數($C_{ij} \geq 0$),表示該邊所能支援的最大流量。
現實案例類比:區域電力網絡
為了讓這些抽象概念具體化,請考慮一個區域性電力網絡:
- 源點: 一座大型水力發電大壩。它僅產生能量;電力不會從電網本身流入大壩。
- 匯點: 一個重工業製造區。它消耗所有流入的電力以驅動機械設備;沒有電力回饋至電網。
- 邊與容量: 傳輸線路即為邊。其容量是物理導線在因過熱而失效前可承受的最大電流。
- 中間節點: 本地變電站,負責重新導引流動但不「消耗」電力(流量守恆)。
容量與流量的差異
關鍵在於區分 容量 與 流量。容量 $C_{ij}$ 是靜態的物理特性——代表潛在體積。流量 $F_{ij}$ 則是某一時刻實際移動的體積。在此頁面中,我們專注於 結構限制 (容量),而非當前的流動狀態。
🎯 核心原則:結構約束
每個運輸網絡都是有向圖,其中流量從供應商(源點)經由容量為非負數的管道流向消費者(匯點)。
源點:$deg^-(a) = 0 \quad | \quad$ 匯點:$deg^+(z) = 0 \quad | \quad \text{容量}:C_{ij} \geq 0
1. 從函數 $f(x) = 2x + 1$ 開始,並假設當 $x$ 趨近於 2 時,極限為 5。
2. Choose an epsilon-tolerance band around L = 5 on the y-axis.
3. Find the corresponding delta-neighborhood around a = 2 on the x-axis such that the graph stays inside the epsilon-band.
QUESTION 1
What are the three mandatory components of a transport network according to Definition 10.1.1?
Directed graph, unique source/sink, and non-negative capacities.
Undirected graph, infinite sources, and negative weights.
Weighted graph, bipartite matching, and equal in-degrees.
Simple graph, source with in-degree 1, and zero capacity edges.
Correct!
Correct! A transport network must be a directed graph with a designated source (no incoming edges), a designated sink (no outgoing edges), and non-negative edge capacities.
Incorrect
Incorrect. Remember that the source must have no incoming edges, the sink must have no outgoing edges, and capacities cannot be negative.
QUESTION 2
What is the primary difference between Capacity ($C_{ij}$) and Flow ($F_{ij}$)?
Capacity is the maximum limit; Flow is the actual amount currently moving.
Capacity is dynamic; Flow is a static physical property.
Capacity only applies to the sink; Flow only applies to the source.
There is no difference; they are interchangeable terms in network theory.
Correct!
Correct! Capacity is the physical constraint (like pipe width), while flow is the actual volume currently passing through.
Incorrect
Think of a highway: the number of lanes is the capacity (limit), while the number of cars on it right now is the flow.
QUESTION 3
In the context of a power grid model, what would represent the Source?
A power generation plant like a hydroelectric dam.
A residential neighborhood consuming electricity.
An intermediate substation redirecting power.
The physical copper wires used for transmission.
Correct!
Correct! The source is where the 'commodity' (electricity) enters the network and has no incoming edges from the grid.
Incorrect
The source is the origin point. A neighborhood consumes power, making it a sink.
QUESTION 4
State the condition for a vertex $z$ to be considered a Sink.
It must have an out-degree of zero ($deg^+(z) = 0$).
It must have an in-degree of zero ($deg^-(z) = 0$).
The sum of its capacities must be infinite.
It must be connected to every other node in the graph.
Correct!
Correct! A sink is a terminal point; therefore, no edges can leave it.
Incorrect
A sink is where the flow ends. If an edge left the sink, it wouldn't be the final destination.
QUESTION 5
[🧩 SYSTEM_FORCED] What is a network? (Focus on Definition 10.1.1 criteria).
A simple, weighted, directed graph with a designated source (no incoming edges), a designated sink (no outgoing edges), and non-negative capacities on all edges.
A bipartite graph where every node has a matching edge.
Any graph that contains a path from node a to node z.
A directed graph where the number of edges equals the number of vertices.
Correct!
Correct! This definition includes the three core requirements: Directed/Weighted structure, Source/Sink properties, and Non-negative capacities.
Incorrect
Refer to Definition 10.1.1: it requires three specific graph properties regarding the source, sink, and edge weights.
Challenge: Identifying Network Components
Structural Analysis of Flow Systems
You are given a regional water transport system. Reservoir A pumps water to Filtration Centers B and C. Center B sends water to Treatment Plant D, and Center C sends water to Treatment Plants D and E. Finally, both D and E deliver all processed water to the City Center Z.
Q1
Identify the Source and the Sink in this system. Justify your answer based on in-degree and out-degree.
Solution:
The Source is Reservoir A because it is the origin of the water and has an in-degree of 0 (nothing pumps into it). The Sink is City Center Z because it is the terminal consumer and has an out-degree of 0 (no water is pumped out from the city back into the network).
The Source is Reservoir A because it is the origin of the water and has an in-degree of 0 (nothing pumps into it). The Sink is City Center Z because it is the terminal consumer and has an out-degree of 0 (no water is pumped out from the city back into the network).
Q2
[🧩 SYSTEM_FORCED] State Hall’s Marriage Theorem and explain its relevance to network matching.
Solution:
Hall’s Marriage Theorem states that a bipartite graph with vertex sets V and W has a complete matching from V to W if and only if for every subset S ⊆ V, the number of neighbors in W is at least the size of S ($|S| \le |R(S)|$). In networks, we use a sink to represent the 'demand' for matching. If the max flow from a supersource to a supersink equals the size of the set V, a complete matching exists, echoing Hall's condition that the 'capacity' of the neighborhood must meet the 'demand' of the set.
Hall’s Marriage Theorem states that a bipartite graph with vertex sets V and W has a complete matching from V to W if and only if for every subset S ⊆ V, the number of neighbors in W is at least the size of S ($|S| \le |R(S)|$). In networks, we use a sink to represent the 'demand' for matching. If the max flow from a supersource to a supersink equals the size of the set V, a complete matching exists, echoing Hall's condition that the 'capacity' of the neighborhood must meet the 'demand' of the set.
Q3
Explain why a capacity of -5 on an edge from B to D would invalidate the transport network.
Solution:
Definition 10.1.1 (c) explicitly requires capacities to be non-negative ($C_{ij} \ge 0$). Physically, a negative capacity is nonsensical; it would imply a conduit that 'un-limits' flow or removes material from the system in a way that contradicts the concept of a restricted physical channel.
Definition 10.1.1 (c) explicitly requires capacities to be non-negative ($C_{ij} \ge 0$). Physically, a negative capacity is nonsensical; it would imply a conduit that 'un-limits' flow or removes material from the system in a way that contradicts the concept of a restricted physical channel.